L2 Vector Median Filters on Arrays with Reconfigurable Optical Buses

نویسندگان

  • Chin-Hsiung Wu
  • Shi-Jinn Horng
چکیده

ÐIn spite of their good filtering characteristics for vector-valued image processing, the usability of vector median filters is limited by their high computational complexity. Given an N N image and a W W window, the computational complexity of vector median filter is O…W 4N2†. In this paper, we design three fast and efficient parallel algorithms for vector median filtering based on the 2-norm (L2) on the arrays with reconfigurable optical buses (AROB). For 1 p W q N, our algorithms run in O…W 4 logW=p4†, O…W 4N2 p4q2 logW † and O…1† times using pN= logW , pq= logW , and W N logN processors, respectively. In the sense of the product of time and the number of processors used, the first two results are cost optimal and the last one is time optimal. Index TermsÐParallel algorithm, scalable algorithm, vector median filter, nonlinear filter, image (signal) processing, reconfigurable optical bus system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses

In this paper we present deterministic algorithms for integer sorting and on-line packet routing on arrays with reconngurable optical buses. The main objective is to identify the mechanisms speciic to this type of architectures that allow us to build eecient integer sorting, partial permutation routing and h-relations algorithms. The consequences of these results on the PRAM simulation complexi...

متن کامل

Efficient Algorithms for the Hough Transform on Arrays with Reconfigurable Optical Buses

This paper examines the possibility of implementing the Hough transform for line and circle detection on arrays with reconfigurable optical buses (AROBs). It is shown that the Hough transform for line and circle detection in an N N image can be implemented in a constant number of steps. The costs of the two algorithms are O(Np) and O(Np), respectively, where p is the magnitude of one dimension ...

متن کامل

Computing the Configuration Space Using Arrays with Reconfigurable Optical Buses

Configuration space computation is a transformation which can be adopted in robot path planning. This process reduces a robot with dimensions to become a single reference point by expanding each obstacle on the image plane. This approach reduces a complex problem into a simple one. In this paper parallel algorithms for computing the configuration space obstacles by using arrays with reconfigura...

متن کامل

Efficient Parallel Algorithms for Hierarchical Clustering on Arrays with Reconfigurable Optical Buses

Clustering is a basic operation in image processing and computer vision, and it plays an important role in unsupervised pattern recognition and image segmentation. While there are many methods for clustering, the single-link hierarchical clustering is one of the most popular techniques. In this paper, with the advantages of both optical transmission and electronic computation, we design efficie...

متن کامل

Internationales Begegnungs-und Forschungszentrum Für Informatik

s of Talks JÜRGEN BECKER The Impact of Reconfigurable Hardware Platforms on the Overhead of Parallelism NEIL W. BERGMANN Identifying Characteristics of Algorithms Which Make Them Suitable for Reconfigurable Computing Implementations GORDON BREBNER Dynamically Reconfigurable FPGAs GORDON BREBNER Soft Circuitry KARL-HEINZ BRENNER Technologies for Realizing Dynamically Reconfigurable Optical Inter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Parallel Distrib. Syst.

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2001